Effects of pattern complexity in solving pattern recognition and pattern production problems
نویسندگان
چکیده
منابع مشابه
pattern recognition in maintenance data using methodologies data minitng (cade study isfahan regional power electric company)
فعالیت های نگهداری و تعمیرات اطلاعاتی را تولید می کند که می تواند در تعیین زمان های بیکاری و ارایه یک برنامه زمان بندی شده یا تعیین هشدارهای خرابی به پرسنل نگهداری و تعمیرات کمک کند. وقتی که مقدار داده های تولید شده زیاد باشند، فهم بین متغیرها بسیار مشکل می شوند. این پایان نامه به کاربردی از داده کاوی برای کاوش پایگاه های داده چندبعدی در حوزه نگهداری و تعمیرات، برای پیدا کردن خرابی هایی که موجب...
15 صفحه اولMaximal pattern complexity, dual system and pattern recognition
For a family Ω of sets in R and a finite subset S of R, let pΩ(S) be the number of distinct sets of the form S ∩ ω for all ω ∈ Ω. The maximum pattern complexity pΩ(k) is the maximum of pΩ(S) among S with #S = k. The S attaining the maximum is considered as the most effective sampling to distinguish the sets in Ω. We obtain the exact values or at least the order of pΩ(k) in k for various classes...
متن کاملOracle Complexity and Nontransitivity in Pattern Recognition
Different mathematical models of recognition processes are known. In present paper we consider a recognizing algorithm as an oracle computation on Turing machine [Rogers]. Such point of view seems to be useful in pattern recognition as well as in recursion theory. Use of recursion theory in pattern recognition shows connection between a recognition algorithm comparison problem and complexity pr...
متن کاملMicroARTMAP for pattern recognition problems
Pattern recognition is an important aspect of a dominant technology such as machine intelligence. Domain specific fuzzy-neuro models particularly for the ‘black box’ implementation of pattern recognition applications have recently been investigated. In this paper, Sanchez’s MicroARTMAP has been discussed as a pattern recognizer/classifier for the image processing problems. The model inherently ...
متن کاملOn sample complexity for computational pattern recognition
In this work we consider the task of pattern recognition in which the target (labelling) function is known to be computable on some Turing machine. It is easy to show that there exist a pattern recognition method for which the number of examples needed to approximate the target function with certain accuracy is linear in the length of the (unknown) program computing the target function. We inve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychonomic Science
سال: 1967
ISSN: 0033-3131
DOI: 10.3758/bf03327883